Min-Max Stochastic Optimization with Applications to the Single-Period Inventory Control Problem
نویسندگان
چکیده
منابع مشابه
inventory control model with stochastic period lneght and delayed payment
in classic inventory control system, we assume that purchasing cost should be paid at time of delivery. but sometimes in order to encourage retailer to increase his order, postpond payment is provided by supplier as an incentive policy for retailer. in this paper a periodic inventory control model is invetigated in which the period between two consecutive replenishmnet is a random variable. in ...
متن کاملMin - Max Control with Application to Discrete
Large classes of dynamic phenomena such as material flow in manufacturing systems, traffic flow in transportation or communication networks, and related scheduling problems can be viewed as discrete event dynamical systems (DEDS); see the papers in [7] for surveys. An efficient approach [3,9] to model large classes of DEDS has been based on the minimax algebra [4] and describes the time dynamic...
متن کاملSingle-period inventory problem under uncertain environment
This paper investigates the single period inventory Newsboy problem in a general uncertain environment. Here it is assumed that the uncertainty appears in the market demand of the product. Uncertain demand is used to describe a subjective estimate (not estimated by random/fuzzy demand), linguistically expressed by ‘‘demand is about n’’. Using identification functions of the uncertain variable w...
متن کاملSingle period stochastic inventory problems with ordering or returns policies
In recent years, there has been an increasing adoption of returns policies in the coordination of the supply chain, where market demand is always assumed to be satisfied by manufacturing or by ordering from suppliers. However, many industries face the important decision of how to balance their inventory level. This problem has long been studied in financial institutions such as banks. This stud...
متن کاملMin-max-min robust combinatorial optimization
The idea of k-adaptability in two-stage robust optimization is to calculate a fixed number k of second-stage policies here-and-now. After the actual scenario is revealed, the best of these policies is selected. This idea leads to a min-max-min problem. In this paper, we consider the case where no first stage variables exist and propose to use this approach to solve combinatorial optimization pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Management Science and Financial Engineering
سال: 2015
ISSN: 2287-2043
DOI: 10.7737/msfe.2015.21.1.011